Skip to main content

All Questions

Tagged with
1vote
0answers
200views

Best algorithm for the Word Ladder puzzle

What would be the best performing algorithm to solve the Word Ladder problem, in terms of guaranteed finding of the shortest solution in the shortest possible time? Is it BFS, DFS, A*, IDA* or another ...
Bill Kavvas's user avatar
1vote
0answers
63views

Which method of tree searching should be used for this board game?

Suppose the following properties of a board game: High branching factor in the beginning of the game (~500) which slowly tends towards 0 at the end of the game Evaluation of the any given board ...
Tauist's user avatar
1vote
0answers
453views

Can we solve an $8 \times 8$ sliding puzzle using hill climbing?

Can we solve an $8 \times 8$ sliding puzzle using a random-restart hill climbing technique (steepest-ascent)? If yes, how much computing power will this need? And what is the maximum $n \times n$ that ...
sudofix's user avatar
0votes
1answer
336views

How do I choose the search algorithm for a particular task?

How do I choose the search algorithm for a particular task? Which criteria should I take into account?
Lexi's user avatar
  • 109
-1votes
2answers
3kviews

How can the A* algorithm be optimized?

How can the A* algorithm be optimized? Any references that shows the optimization of A* algorithm are also appreciated.
Lexi's user avatar
  • 109
2votes
1answer
202views

What kind of search method is A*?

What kind of search method is A*? Explain to me with an example.
Maira Khan's user avatar
10votes
2answers
27kviews

What are the limitations of the hill climbing algorithm and how to overcome them?

What are the limitations of the hill climbing algorithm? How can we overcome these limitations?
Abbas Ali's user avatar
14votes
3answers
69kviews

What are the differences between A* and greedy best-first search?

What are the differences between the A* algorithm and the greedy best-first search algorithm? Which one should I use? Which algorithm is the better one, and why?
Marosh Fatima's user avatar
6votes
2answers
640views

Why is the larger value, as opposed to the smaller one, chosen, in the hill climbing algorithm?

In the hill climbing algorithm, the greater value, compared to the current value, is selected, but I cannot understand why it takes the larger value instead of the smaller one. Why is that? I greatly ...
Khan's user avatar
6votes
1answer
11kviews

What is the difference between local search and global search algorithms?

What is the difference between local search and global (or complete) search algorithms?
Jayani Sumudini's user avatar

close